ON THE COMPUTATION OF THE DIGITAL CONVEX HULL AND CIRCULAR HULL OF A DIGITAL REGION
Identifieur interne : 002113 ( Main/Exploration ); précédent : 002112; suivant : 002114ON THE COMPUTATION OF THE DIGITAL CONVEX HULL AND CIRCULAR HULL OF A DIGITAL REGION
Auteurs : Bidyut Baran Chaudhuri [Inde] ; A. Rosenfeld [États-Unis]Source :
- Pattern Recognition [ 0031-3203 ] ; 1997.
Abstract
The problems of defining convexity and circularity of a digital region are considered. A new definition of digital convexity, called DL- (digital line) convexity, is proposed. A region is DL-convex if, for any two pixels belonging to it, there exists a digital straight line between them all of whose pixels belong to the region. DL-convexity is shown to be stronger that two other definitions, T- (triangle) convexity and L- (line) convexity. A digital region is T-convex if it is DL-convex, but the converse is not generally true. This is because a DL-convex region must be connected, but T- and L-convex regions can be disconnected. An algorithm to compute the DL-convex hull of a digital region is described. A related problem, the computation of the circular hull and its application to testing the circularity of a digital region, is also considered, and an algorithm is given that is computationally cheaper than a previous algorithm for testing circularity.
Url:
DOI: 10.1016/S0031-3203(98)00065-X
Affiliations:
- Inde, États-Unis
- Bengale-Occidental, Maryland
- Calcutta, College Park (Maryland)
- Institut indien de statistiques, Université du Maryland
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000A85
- to stream Istex, to step Curation: 000A72
- to stream Istex, to step Checkpoint: 001617
- to stream Main, to step Merge: 002230
- to stream Main, to step Curation: 002113
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>ON THE COMPUTATION OF THE DIGITAL CONVEX HULL AND CIRCULAR HULL OF A DIGITAL REGION</title><author><name sortKey="Chaudhuri, B B" sort="Chaudhuri, B B" uniqKey="Chaudhuri B" first="B. B." last="Chaudhuri">Bidyut Baran Chaudhuri</name><affiliation><country>Inde</country><placeName><settlement type="city">Calcutta</settlement><region type="province">Bengale-Occidental</region></placeName><orgName type="lab" n="5">Institut indien de statistiques</orgName></affiliation></author><author><name sortKey="Rosenfeld, A" sort="Rosenfeld, A" uniqKey="Rosenfeld A" first="A." last="Rosenfeld">A. Rosenfeld</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:3542CE5C589624C42BBE80863FB59184B62FB0EA</idno><date when="1998" year="1998">1998</date><idno type="doi">10.1016/S0031-3203(98)00065-X</idno><idno type="url">https://api.istex.fr/document/3542CE5C589624C42BBE80863FB59184B62FB0EA/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000A85</idno><idno type="wicri:Area/Istex/Curation">000A72</idno><idno type="wicri:Area/Istex/Checkpoint">001617</idno><idno type="wicri:doubleKey">0031-3203:1998:Chaudhuri B:on:the:computation</idno><idno type="wicri:Area/Main/Merge">002230</idno><idno type="wicri:Area/Main/Curation">002113</idno><idno type="wicri:Area/Main/Exploration">002113</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">ON THE COMPUTATION OF THE DIGITAL CONVEX HULL AND CIRCULAR HULL OF A DIGITAL REGION</title><author><name sortKey="Chaudhuri, B B" sort="Chaudhuri, B B" uniqKey="Chaudhuri B" first="B. B." last="Chaudhuri">Bidyut Baran Chaudhuri</name><affiliation wicri:level="1"><country xml:lang="fr">Inde</country><wicri:regionArea>Computer Vision and Pattern Recognition Unit, Indian Statistical Institute, 203 B. T. Road, Calcutta 700 035</wicri:regionArea><wicri:noRegion>Calcutta 700 035</wicri:noRegion><placeName><settlement type="city">Calcutta</settlement><region type="province">Bengale-Occidental</region></placeName><orgName type="lab" n="5">Institut indien de statistiques</orgName></affiliation></author><author><name sortKey="Rosenfeld, A" sort="Rosenfeld, A" uniqKey="Rosenfeld A" first="A." last="Rosenfeld">A. Rosenfeld</name><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation><affiliation wicri:level="4"><country xml:lang="fr">États-Unis</country><wicri:regionArea>Center for Automation Research, University of Maryland, College Park, MD 20742-3275</wicri:regionArea><placeName><region type="state">Maryland</region><settlement type="city">College Park (Maryland)</settlement></placeName><orgName type="university">Université du Maryland</orgName></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition</title><title level="j" type="abbrev">PR</title><idno type="ISSN">0031-3203</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1997">1997</date><biblScope unit="volume">31</biblScope><biblScope unit="issue">12</biblScope><biblScope unit="page" from="2007">2007</biblScope><biblScope unit="page" to="2016">2016</biblScope></imprint><idno type="ISSN">0031-3203</idno></series><idno type="istex">3542CE5C589624C42BBE80863FB59184B62FB0EA</idno><idno type="DOI">10.1016/S0031-3203(98)00065-X</idno><idno type="PII">S0031-3203(98)00065-X</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0031-3203</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">The problems of defining convexity and circularity of a digital region are considered. A new definition of digital convexity, called DL- (digital line) convexity, is proposed. A region is DL-convex if, for any two pixels belonging to it, there exists a digital straight line between them all of whose pixels belong to the region. DL-convexity is shown to be stronger that two other definitions, T- (triangle) convexity and L- (line) convexity. A digital region is T-convex if it is DL-convex, but the converse is not generally true. This is because a DL-convex region must be connected, but T- and L-convex regions can be disconnected. An algorithm to compute the DL-convex hull of a digital region is described. A related problem, the computation of the circular hull and its application to testing the circularity of a digital region, is also considered, and an algorithm is given that is computationally cheaper than a previous algorithm for testing circularity.</div></front></TEI><affiliations><list><country><li>Inde</li><li>États-Unis</li></country><region><li>Bengale-Occidental</li><li>Maryland</li></region><settlement><li>Calcutta</li><li>College Park (Maryland)</li></settlement><orgName><li>Institut indien de statistiques</li><li>Université du Maryland</li></orgName></list><tree><country name="Inde"><region name="Bengale-Occidental"><name sortKey="Chaudhuri, B B" sort="Chaudhuri, B B" uniqKey="Chaudhuri B" first="B. B." last="Chaudhuri">Bidyut Baran Chaudhuri</name></region></country><country name="États-Unis"><noRegion><name sortKey="Rosenfeld, A" sort="Rosenfeld, A" uniqKey="Rosenfeld A" first="A." last="Rosenfeld">A. Rosenfeld</name></noRegion><name sortKey="Rosenfeld, A" sort="Rosenfeld, A" uniqKey="Rosenfeld A" first="A." last="Rosenfeld">A. Rosenfeld</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002113 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 002113 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:3542CE5C589624C42BBE80863FB59184B62FB0EA
|texte= ON THE COMPUTATION OF THE DIGITAL CONVEX HULL AND CIRCULAR HULL OF A DIGITAL REGION
}}
| This area was generated with Dilib version V0.6.32. |  |